CTRD: a fast applet for computing signed translocation distance between genomes
نویسندگان
چکیده
منابع مشابه
CTRD: a fast applet for computing signed translocation distance between genomes
CTRD is a software for computing translocation distance between genomes. It takes two genomes as its input and tests whether one genome can be transformed into the other. If possible, it computes the translocation distance between two genomes, and gives the translocation operation serial. We adopt the fastest known O(n(2)log n) algorithm. Our contributions include (1) give a necessary and suffi...
متن کاملPolynomial-time Algorithm for Computing Translocation Distance between Genomes
With the advent of large-scale DNA physical mapping and se-quencing, studies of genome rearrangements are becoming increasingly important in evolutionary molecular biology. From a computational perspective, study of evolution based on rearrangements leads to rearrangement distance problem, i.e., computing the minimum number of rearrangement events required to transform one genome into another. ...
متن کاملComputing the Breakpoint Distance between Partially Ordered Genomes
The total order of genes or markers on a chromosome is crucial for most comparative genomics studies. However, current gene mapping efforts might only suffice to provide a partial order of the genes on a chromosome. Several different genes or markers might be mapped at the same position due to the low resolution of gene mapping or missing data. Moreover, conflicting datasets might give rise to ...
متن کاملA Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study
Hannenhalli and Pevzner gave the first polynomial-time algorithm for computing the inversion distance between two signed permutations, as part of the larger task of determining the shortest sequence of inversions needed to transform one permutation into the other. Their algorithm (restricted to distance calculation) proceeds in two stages: in the first stage, the overlap graph induced by the pe...
متن کاملFast convolution-based methods for computing the signed distance function and its derivatives
We present a fast convolution-based technique for computing an approximate, signed Euclidean distance function on a set of 2D and 3D grid locations. Instead of solving the non-linear, static Hamilton-Jacobi equation (‖∇S‖ = 1), our solution stems from first solving for a scalar field φ in a linear differential equation and then deriving the solution for S by taking the negative logarithm. In ot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2004
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/bth356